منابع مشابه
Eigenvalue Computations Based on IDR
The induced dimension reduction (IDR) method, which has been introduced as a transpose-free Krylov space method for solving nonsymmetric linear systems, can also be used to determine approximate eigenvalues of a matrix or operator. The IDR residual polynomials are the products of a residual polynomial constructed by successively appending linear smoothing factors and the residual polynomials of...
متن کاملMulti-dimensional gyrokinetic parameter studies based on eigenvalue computations
a r t i c l e i n f o a b s t r a c t Plasma microinstabilities, which can be described in the framework of the linear gyrokinetic equations, are routinely computed in the context of stability analyses and transport predictions for magnetic confinement fusion experiments. The GENE code, which solves the gyrokinetic equations, has been coupled to the SLEPc package for an efficient iterative, mat...
متن کاملLecture 14: Eigenvalue Computations
This lecture discusses a few numerical methods for the computation of eigenvalues and eigenvectors of matrices. Most of this lecture will focus on the computation of a few eigenvalues of a large symmetric matrix, but some nonsymmetric matrices also will be considered, including the Google matrix. The QRalgorithm for both symmetric and nonsymmetric matrices of small to modest size will be discus...
متن کاملMultigrain Parallelism for Eigenvalue Computations on Networks of Clusters
Clusters of workstations have become a cost-effective means of performing scientific computations. However, large network latencies, resource sharing, and heterogeneity found in networks of clusters and Grids can impede the performance of applications not specifically tailored for use in such environments. A typical example is the traditional fine grain implementations of Krylov-like iterative ...
متن کاملComputations of Eigenvalue Avoidance in Planar Domains
The phenomenon of eigenvalue avoidance is of growing interest in applications ranging from quantum mechanics to the theory of the Riemann zeta function. Until now the computation of eigenvalues of the Laplace operator in planar domains has been a difficult problem, making it hard to compute eigenvalue avoidance. Based on a new method this paper presents the computation of eigenvalue avoidance f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2013
ISSN: 0895-4798,1095-7162
DOI: 10.1137/100804012